Improving the Decoding Speed of Packet Recovery in Network Coding

The reliability of communication channels is one of the most challenging tasks in wireless communication. Network coding (NC) has emerged as a compelling solution to improve throughput performance and reliability by sending coded packets and accepting valid ones at the receiver. Discarding corrupted coded packets in NC often meant discarding potentially useful information. Thus, using forward error correction (FEC) in each coded packet makes the corrupted packets useful at the receiver. In this letter, we propose a fast decoding algorithm for packet recovery in NC (F-PRNC) using an algebraic consistency between the coded packets to detect their possible corrupted parts. We provided a complexity analysis of the F-PRNC and compared it with partial packet recovery schemes such as DAPRAC and S-PRAC. Our simulation result shows that F-PRNC exceeds both methods in a variety of conditions.